Congestion Games and Potentials Reconsidered

In congestion games, players use facilities from a common pool. The benefit that a player derives from using a facility depends, possibly among other things, on the number of users of this facility. The paper gives an easy alternative proof of the isomorphism between exact potential games and the set of congestion games introduced by Rosenthal (1973). It clarifies the relations between existing models on congestion games, and studies a class of congestion games where the sets of Nash equilibria, strong Nash equilibria and potential-maximising strategies coincide. Particular emphasis is on the computation of potential-maximising strategies.